Conditional semi-Thue systems for presenting monoids
Identifieur interne : 00D686 ( Main/Exploration ); précédent : 00D685; suivant : 00D687Conditional semi-Thue systems for presenting monoids
Auteurs : Thomas Dei [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: There are well known examples of monoids in literature which do not admit a finite and canonical presentation by a semi-Thue system over a fixed alphabet, not even over an arbitrary alphabet. We introduce conditional Thue and semi-Thue systems similar to conditional term rewriting systems as defined by Kaplan. Using these conditional semi-Thue systems we give finite and canonical presentations of the examples mentioned above. Furthermore we show, that every finitely generated monoid with decidable word problem is embeddable in a monoid which has a finite canonical conditional presentation.
Url:
DOI: 10.1007/3-540-55210-3_212
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001806
- to stream Istex, to step Curation: 001787
- to stream Istex, to step Checkpoint: 003026
- to stream Main, to step Merge: 00DF63
- to stream Main, to step Curation: 00D686
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Conditional semi-Thue systems for presenting monoids</title><author><name sortKey="Dei, Thomas" sort="Dei, Thomas" uniqKey="Dei T" first="Thomas" last="Dei">Thomas Dei</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:6777C1F591E3D6CE8D888939133953B042414146</idno><date when="1992" year="1992">1992</date><idno type="doi">10.1007/3-540-55210-3_212</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-WV33L92N-P/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001806</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001806</idno><idno type="wicri:Area/Istex/Curation">001787</idno><idno type="wicri:Area/Istex/Checkpoint">003026</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003026</idno><idno type="wicri:doubleKey">0302-9743:1992:Dei T:conditional:semi:thue</idno><idno type="wicri:Area/Main/Merge">00DF63</idno><idno type="wicri:Area/Main/Curation">00D686</idno><idno type="wicri:Area/Main/Exploration">00D686</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Conditional semi-Thue systems for presenting monoids</title><author><name sortKey="Dei, Thomas" sort="Dei, Thomas" uniqKey="Dei T" first="Thomas" last="Dei">Thomas Dei</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich Informatik, Universität Kaiserslautern, Erwin Schrödinger Straße, W-6750, Kaiserslautern</wicri:regionArea><placeName><region type="land" nuts="2">Rhénanie-Palatinat</region><settlement type="city">Kaiserslautern</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: There are well known examples of monoids in literature which do not admit a finite and canonical presentation by a semi-Thue system over a fixed alphabet, not even over an arbitrary alphabet. We introduce conditional Thue and semi-Thue systems similar to conditional term rewriting systems as defined by Kaplan. Using these conditional semi-Thue systems we give finite and canonical presentations of the examples mentioned above. Furthermore we show, that every finitely generated monoid with decidable word problem is embeddable in a monoid which has a finite canonical conditional presentation.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Kaiserslautern</li></settlement></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Dei, Thomas" sort="Dei, Thomas" uniqKey="Dei T" first="Thomas" last="Dei">Thomas Dei</name></region><name sortKey="Dei, Thomas" sort="Dei, Thomas" uniqKey="Dei T" first="Thomas" last="Dei">Thomas Dei</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00D686 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00D686 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:6777C1F591E3D6CE8D888939133953B042414146
|texte= Conditional semi-Thue systems for presenting monoids
}}
| This area was generated with Dilib version V0.6.33. |  |